منابع مشابه
Chain Decompositions of 4-Connected Graphs
In this paper we give a decomposition of a 4-connected graph G into nonseparating chains, which is similar to an ear decomposition of a 2-connected graph. We also give an O(|V (G)||E(G)|) algorithm that constructs such a decomposition. In applications, the asymptotic performance can often be improved to O(|V (G)|). This decomposition will be used to find four independent spanning trees in a 4co...
متن کاملFriendship decompositions of graphs
We investigate the maximum number of elements in an optimal t-friendship decomposition of graphs of order n. Asymptotic results will be obtained for all fixed t ≥ 4 and for t = 2, 3 exact results will be derived.
متن کاملNodal Decompositions of Graphs
A nodal domain of a function is a maximally connected subset of the domain for which the function does not change sign. Courant’s nodal domain theorem gives a bound on the number of nodal domains of eigenfunctions of elliptic operators. In particular, the kth eigenfunction contains no more than k nodal domains. We prove a generalization of Courant’s theorem to discrete graphs. Namely, we show t...
متن کاملTransitive decompositions of graphs
A decomposition of a graph is a partition of the edge set. One can also look at partitions of the arc set but in this talk we restrict our attention to edges. If each part of the decomposition is a spanning subgraph then we call the decomposition a factorisation and the parts are called factors. Decompositions are especially interesting when the subgraphs induced by each part are pairwise isomo...
متن کاملAutomorphic Decompositions of Graphs
Given graphs H and G, we say that H has a G-Decomposition if we are to partition the edge set of H so that for each part P of the partition, the subgraph of H induced by P is isomorphic to G. Let I(D) be the intersection generated by such a decomposition. We say that D is an automorphic decomposition of H with respect to G if I(D) ∼= H. In this talk, we will show several examples of such a deco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1985
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700009448